8 results
Simplifying Inclusion–Exclusion Formulas
-
- Journal:
- Combinatorics, Probability and Computing / Volume 24 / Issue 2 / March 2015
- Published online by Cambridge University Press:
- 14 October 2014, pp. 438-456
-
- Article
- Export citation
Near-Optimal Separators in String Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 23 / Issue 1 / January 2014
- Published online by Cambridge University Press:
- 07 October 2013, pp. 135-139
-
- Article
- Export citation
Unit Distances in Three Dimensions
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 4 / July 2012
- Published online by Cambridge University Press:
- 25 April 2012, pp. 597-610
-
- Article
- Export citation
Graph Colouring with No Large Monochromatic Components
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 4 / July 2008
- Published online by Cambridge University Press:
- 01 July 2008, pp. 577-589
-
- Article
- Export citation
The Minimum Independence Number of a Hasse Diagram
-
- Journal:
- Combinatorics, Probability and Computing / Volume 15 / Issue 3 / May 2006
- Published online by Cambridge University Press:
- 07 April 2006, pp. 473-475
-
- Article
- Export citation
A Lower Bound on the Size of Lipschitz Subsets in Dimension 3
-
- Journal:
- Combinatorics, Probability and Computing / Volume 12 / Issue 4 / July 2003
- Published online by Cambridge University Press:
- 04 July 2003, pp. 427-430
-
- Article
- Export citation
ON THE DISCREPANCY FOR CARTESIAN PRODUCTS
-
- Journal:
- Journal of the London Mathematical Society / Volume 61 / Issue 3 / June 2000
- Published online by Cambridge University Press:
- 01 June 2000, pp. 737-747
- Print publication:
- June 2000
-
- Article
- Export citation
On discrepancy bounds via dual shatter function
- Part of
-
- Journal:
- Mathematika / Volume 44 / Issue 1 / June 1997
- Published online by Cambridge University Press:
- 26 February 2010, pp. 42-49
- Print publication:
- June 1997
-
- Article
- Export citation